home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
C & C++ Multimedia Cyber Classroom
/
C and C++ Multimedia Cyber Classroom (Prentice Hall) (1998).iso
/
src
/
fig20_31.jar
/
Ch20
/
Fig20_31
/
fig20_31.cpp
Wrap
C/C++ Source or Header
|
1997-10-22
|
2KB
|
66 lines
// Fig. 20.31: fig20_31.cpp
// Demonstrates search and sort capabilities.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
bool greater10( int value );
int main()
{
const int SIZE = 10;
int a[ SIZE ] = { 10, 2, 17, 5, 16, 8, 13, 11, 20, 7 };
vector< int > v( a, a + SIZE );
ostream_iterator< int > output( cout, " " );
cout << "Vector v contains: ";
copy( v.begin(), v.end(), output );
vector< int >::iterator location;
location = find( v.begin(), v.end(), 16 );
if ( location != v.end() )
cout << "\n\nFound 16 at location "
<< ( location - v.begin() );
else
cout << "\n\n16 not found";
location = find( v.begin(), v.end(), 100 );
if ( location != v.end() )
cout << "\nFound 100 at location "
<< ( location - v.begin() );
else
cout << "\n100 not found";
location = find_if( v.begin(), v.end(), greater10 );
if ( location != v.end() )
cout << "\n\nThe first value greater than 10 is "
<< *location << "\nfound at location "
<< ( location - v.begin() );
else
cout << "\n\nNo values greater than 10 were found";
sort( v.begin(), v.end() );
cout << "\n\nVector v after sort: ";
copy( v.begin(), v.end(), output );
if ( binary_search( v.begin(), v.end(), 13 ) )
cout << "\n\n13 was found in v";
else
cout << "\n\n13 was not found in v";
if ( binary_search( v.begin(), v.end(), 100 ) )
cout << "\n100 was found in v";
else
cout << "\n100 was not found in v";
cout << endl;
return 0;
}
bool greater10( int value ) { return value > 10; }